Some remarks on entropic distance, entropic measure of connexion and Hamming distance
نویسندگان
چکیده
— The relationship between entropie distance, entropie measure of connexion or interdependence and Hamming distance is investigated. Some applications to the classification ofthe families of curves are also given. Résumé. — On étudie la relation entre la distance entropique, la mesure entropique de connexion ou interdépendance et la distance de Hamming, avec quelques applications à la classification de familles de courbes.
منابع مشابه
Inverse Maximum Dynamic Flow Problem under the Sum-Type Weighted Hamming Distance
Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...
متن کاملEntropic Economic Order Quantity Model for Items with Imperfect Quality Considering Constant Rate of Deterioration under Fuzzy Inflationary Conditions
It was suggested in 2004 by some researchers that it might be possible to improve production systems performance by applying the first and second laws of thermodynamics to reduce system entropy. Then these laws were used to modify the economic order quantity (EOQ) model to derive an equivalent entropic order quantity (EnOQ). Moreover the political instability or uncertainty of a country (as wel...
متن کاملSeveral new results based on the study of distance measures of intuitionistic fuzzy sets
It is doubtless that intuitionistic fuzzy set (IFS) theory plays an increasingly important role in solving the problems under uncertain situation. As one of the most critical members in the theory, distance measure is widely used in many aspects. Nevertheless, it is a pity that part of the existing distance measures has some drawbacks in practical significance and accuracy. To make up for their...
متن کاملRemarks on Distance-Balanced Graphs
Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.
متن کاملNew distance and similarity measures for hesitant fuzzy soft sets
The hesitant fuzzy soft set (HFSS), as a combination of hesitant fuzzy and soft sets, is regarded as a useful tool for dealing with the uncertainty and ambiguity of real-world problems. In HFSSs, each element is defined in terms of several parameters with arbitrary membership degrees. In addition, distance and similarity measures are considered as the important tools in different areas such as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017